Analyzing combined vehicle routing and break scheduling from a distributed decision making perspective

We analyze the problem of combined vehicle routing and break scheduling from a distributed decision making perspective. The problem of combined vehicle routing and break scheduling can be defined as the problem of finding vehicle routes to serve a set of customers such that a cost criterion is minimized and legal rules on driving and working hours are observed. In the literature, this problem is always analyzed from a central planning perspective. In practice, however, this problem is solved interactively between planners and drivers. In\ud many practical scenarios, the planner first clusters the customer requests and instructs the drivers which customers they have to visit. Subsequently, the drivers decide upon the routes to be taken and their break schedules. We apply a framework for distributed decision making to model this planning scenario and propose various ways for planners to anticipate the drivers' planning behavior. Especially in the case of antagonistic objectives, which are often encountered in practice, a distributed decision making perspective is necessary to analyze this planning process. Computational experiments demonstrate that a high degree of anticipation by the planner has a strong positive impact on the overall planning quality, especially in the case of conflicting planner's and drivers' objectives

НИЖНИЕ ГРАНИЦЫ ЦЕЛЕВОЙ ФУНКЦИИ В ЗАДАЧE НАЗНАЧЕНИЯ ПОЕЗДОВ НА ВРЕМЕННЫЕ ИНТЕРВАЛЫ

In this paper we consider the container transshipment problem at a railway hub. New lowerbounds are developed. One lower bound is based on the linear relaxation of the integer linear formulation, and the other lower bound is based on the Lagrangian relaxation technique.Рассматривается задача оптимизации выполнения множества операций по перемещению контейнеров на железнодорожном узле. Разрабатываются нижняя граница, основанная на релакси-рованной задаче линейного программирования, и нижняя граница, полученная с помощью техники лагранжевой релаксаци

combinatorial reverse auction

for a bi-objective winner determination problem in a combinatorial reverse auctio